On Approximate Majority and Probabilistic Time
نویسندگان
چکیده
منابع مشابه
Probabilistic consensus via polling and majority rules
In this paper, we consider lightweight decentralised algorithms for achieving consensus in distributed systems. Each member of a distributed group has a private value from a fixed set consisting of, say, two elements, and the goal is for all members to reach consensus on the majority value. We explore variants of the voter model applied to this problem. In the voter model, each node polls a ran...
متن کاملThe Cell Cycle Switch Computes Approximate Majority
Both computational and biological systems have to make decisions about switching from one state to another. The 'Approximate Majority' computational algorithm provides the asymptotically fastest way to reach a common decision by all members of a population between two possible outcomes, where the decision approximately matches the initial relative majority. The network that regulates the mitoti...
متن کاملSome Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game
This paper investigates the expected agreement time of a probabilistic polling game on a connected graph. Given a connected graph G with an assignment of a value in {0, 1} to each vertex, we consider a polling game on G that repeats the following π-polling forever, where π = (π1, · · · , πn) is a stochastic vector, i.e., πk ≥ 0, ∑n k=1 πk = 1: For k randomly chosen vertices v with probability π...
متن کاملApproximate Probabilistic Power Flow
Power flow analysis is a necessary tool for operating and planning Power systems. This tool uses a deterministic approach for obtaining the steady state of the system for a specified set of power generation, loads, and network conditions. However this deterministic methodology does not take into account the uncertainty in the power systems, for example variability the in power generation, varia...
متن کاملProbabilistic Approximate Least-Squares
Least-squares and kernel-ridge / Gaussian process regression are among the foundational algorithms of statistics and machine learning. Famously, the worst-case cost of exact nonparametric regression grows cubically with the data-set size; but a growing number of approximations have been developed that estimate good solutions at lower cost. These algorithms typically return point estimators, wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2009
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-009-0267-3